closed orthant

См. также в других словарях:

• Orthant — In two dimensions, there are 4 orthants (called quadrants) In geometry, an orthant[1] or hyperoctant[2] is the analogue in n dimensional Euclidean space of a …   Wikipedia

• Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… …   Wikipedia

• Convex cone — In linear algebra, a convex cone is a subset of a vector space over an ordered field that is closed under linear combinations with positive coefficients. A convex cone (light blue). Inside of it, the light red convex cone consists of all points… …   Wikipedia

• Dual cone and polar cone — A set C and its dual cone C * …   Wikipedia

• Cartesian coordinate system — Illustration of a Cartesian coordinate plane. Four points are marked and labeled with their coordinates: (2, 3) in green, (−3, 1) in red, (−1.5, −2.5) in blue, and the origin (0, 0) in purple. A Cartesian coordinate system specifies each point… …   Wikipedia

• Cross-polytope — In geometry, a cross polytope,[1] orthoplex,[2] hyperoctahedron, or cocube is a regular, convex polytope that exists in any number of dimensions. The vertices of a cross polytope are all the permutations of (±1, 0, 0, …, 0). The cross polytope is …   Wikipedia

• List of mathematics articles (O) — NOTOC O O minimal theory O Nan group O(n) Obelus Oberwolfach Prize Object of the mind Object theory Oblate spheroid Oblate spheroidal coordinates Oblique projection Oblique reflection Observability Observability Gramian Observable subgroup… …   Wikipedia

• Glossary of semisimple groups — This is a glossary for the terminology applied in the mathematical theories of semisimple Lie groups. It also covers terms related to their Lie algebras, their representation theory, and various geometric, algebraic and combinatorial structures… …   Wikipedia

• Conic optimization — is a subfield of convex optimization that studies a class of structured convex optimization problems called conic optimization problems. A conic optimization problem consists of minimizing a convex function over the intersection of an affine… …   Wikipedia